Domain identification by iterative analysis of error-scaled difference distance matrices

Domain identification by iterative analysis of error-scaled difference distance matrices.

Iterative interpretation of error-scaled difference distance matrices is suggested as a means of dividing a protein into structural domains on the basis of conformational differences between different models. Two conformers of Src kinase [PDB codes 1fmk [Xu et al. (1997). Nature (London), 385, 595-602] and 2src [Xu et al. (1999). Mol. Cell, 3, 629-638]] in the inactive state with and without a ...

An iterative approach for estimation of efficiency by weighted distance

Pinchings and Norms of Scaled Triangular Matrices 1 Pinchings and Norms of Scaled Triangular Matrices

Suppose U is an upper-triangular matrix, and D a nonsingular diagonal matrix whose diagonal entries appear in nondescending order of magnitude down the diagonal. It is proved that kD UDk kUk for any matrix norm that is reduced by a pinching. In addition to known examples { weakly unitarily invariant norms { we show that any matrix norm de ned by kAk def = max x 6=0; y 6=0 Re (x Ay) (x) (y) ; wh...

an iterative approach for estimation of efficiency by weighted distance

Improvements of two preconditioned AOR iterative methods for Z-matrices

‎In this paper‎, ‎we propose two preconditioned AOR iterative methods to solve systems of linear equations whose coefficient matrices are Z-matrix‎. ‎These methods can be considered as improvements of two previously presented ones in the literature‎. ‎Finally some numerical experiments are given to show the effectiveness of the proposed preconditioners‎.‎